Warped Landscapes and Random Acts of SAT Solving
نویسندگان
چکیده
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modify the search landscape during the search process by means of dynamically changing clause penalties. In this work, we study whether the resulting, ‘warped’ landscapes are easier to search than the landscapes that correspond to the original problem instances. We present empirical evidence indicating that (somewhat contrary to common belief) this is not the case, and that the main benefit of the dynamic penalty update mechanism in SAPS is an effective diversification of the search process. In most other high-performance stochastic local search algorithms, the same effect is achieved by the strong use of randomised decisions throughout the search. We demonstrate that in SAPS, random decisions are only required in the (standard) search initialisation procedure, and can be completely eliminated from the remainder of the subsequent search process without any significant change in the behaviour or performance of the resulting algorithms compared to the original, fully randomised SAPS algorithm. We conjecture that the reason for this unexpected result lies in the ability of the deterministic variants of the scaling and smoothing mechanism and the subsidiary iterative best improvement mechanism underlying SAPS to effectively propagate the effects of initial randomisation throughout a search process that shows the sensitive dependence on inditial conditions that is characteristic for chaotic processes.
منابع مشابه
Measures on Sat Landscapes by Statistical Exploration of Search Trees
Stochastic local search methods are widely used for solving positive instances of NP-hard problems. They are based on a partial exploration of a local search landscape characterized by a nite set, a tness function and a neighborhood relation. We think that theoretical or experimental study of these landscapes, independently of search algorithms , could provide a better understanding of local se...
متن کاملBarriers and local minima in energy landscapes of stochastic local search
A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive adjacent states in an “energy landscape” defined by the problem instance on the n-dimensional Boolean hypercube. We investigate analytically the worst-case topography of such landscapes in the context of satisfiable k-S...
متن کاملLocal search for Boolean Satisfiability with configuration checking and subscore
This paper presents and analyzes two new efficient local search strategies for the Boolean Satisfiability (SAT) problem. We start by proposing a local search strategy called configuration checking (CC) for SAT. The CC strategy results in a simple local search algorithm for SAT called Swcc, which shows promising experimental results on random 3-SAT instances, and outperforms TNM, the winner of S...
متن کاملEagleUP: Solving Random 3-SAT Using SLS with Unit Propagation
This paper introduces a novel approach which combines SLS SAT solving and unit propagation to realize fast performance on huge satisfiable uniform random 3-CNF formulas. Currently, applying unit propagation within local search solvers was only beneficial for structured formulas. We show how unit propagation can be combined with SLS solvers to realize speed-ups on random formulas as well. Our no...
متن کاملOn the Empirical Time Complexity of Random 3-SAT at the Phase Transition
The time complexity of problems and algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. In this context, propositional satisfiability (SAT) is one of the most intensely studied problems, and it is generally believed that solving SAT requires exponential ti...
متن کامل